- Title
- SamplingCA: effective and efficient sampling-based pairwise testing for highly configurable software systems
- Creator
- Luo, Chuan; Zhao, Qiyuan; Cai, Shaowei; Zhang, Hongyu; Hu, Chunming
- Relation
- 30th ACM Joint Meeting European Software Engineering Conference and Symposium on the Foundations of Software Engineering. Proceedings of the 30th ACM Joint Meeting European Software Engineering Conference and Symposium on the Foundations of Software Engineering (Singapore 14-18 November, 2022) p. 1185-1197
- Publisher Link
- http://dx.doi.org/10.1145/3540250.3549155
- Publisher
- ACM
- Resource Type
- conference paper
- Date
- 2022
- Description
- Combinatorial interaction testing (CIT) is an effective paradigm for testing highly configurable systems, and its goal is to generate a t-wise covering array (CA) as a test suite, where t is the strength of testing. It is recognized that pairwise testing (i.e., CIT with t=2) is the most common CIT technique, and has high fault detection capability in practice. The problem of pairwise CA generation (PCAG), which is a core problem in pairwise testing, aims at generating a pairwise CA (i.e., 2-wise CA) of minimum size, subject to hard constraints. The PCAG problem is a hard combinatorial optimization problem, which urgently requires practical methods for generating pairwise CAs (PCAs) of small sizes. However, existing PCAG algorithms suffer from the severe scalability issue; that is, when solving large-scale PCAG instances, existing state-of-the-art PCAG algorithms usually cost a fairly long time to generate large PCAs, which would make the testing of highly configurable systems both ineffective and inefficient. In this paper, we propose a novel and effective sampling-based approach dubbed SamplingCA for solving the PCAG problem. SamplingCA first utilizes sampling techniques to obtain a small test suite that covers valid pairwise tuples as many as possible, and then adds a few more test cases into the test suite to ensure that all valid pairwise tuples are covered. Extensive experiments on 125 public PCAG instances show that our approach can generate much smaller PCAs than its state-of-the-art competitors, indicating the effectiveness of SamplingCA. Also, our experiments show that SamplingCA runs one to two orders of magnitude faster than its competitors, demonstrating the efficiency of SamplingCA. Our results confirm that SamplingCA is able to address the scalability issue and considerably pushes forward the state of the art in PCAG solving.
- Subject
- pairwise testing; covering array; sampling; satisfiability
- Identifier
- http://hdl.handle.net/1959.13/1500535
- Identifier
- uon:54951
- Identifier
- ISBN:9781450394130
- Language
- eng
- Reviewed
- Hits: 131
- Visitors: 131
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|